Testing the Adequacy of Automated Explanations of EL Subsumptions

نویسندگان

  • Marvin R. G. Schiller
  • Florian Schiller
  • Birte Glimm
چکیده

Ontology verbalization techniques have been introduced to automatically translate description logic (DL) axioms and derivations to natural-language texts. This way, non-expert users can be offered explanations for subsumptions derived by systems using ontologies for knowledge-representation. We address the question of the readability and understandability of explanations generated from longer chains of inference steps, as they occur with non-trivial ontologies. An experimental design is presented to assess readers’ understanding, the readability and the quality of the generated texts. The experiment tests verbalizations of derivations of different lengths, and assesses the effect of a strategy proposed to shorten explanations while retaining an adequate level of informativeness.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deciding Subsumers of Least Fixpoint Concepts w.r.t. general EL -TBoxes

In this paper we provide a procedure for deciding subsumptions of the form T |= C v E, where C is an ELUμ-concept, E an ELUconcept and T a general EL-TBox. Deciding such subsumptions can be used for computing the logical difference between general EL-TBoxes. Our procedure is based on checking for the existence of a certain simulation between hypergraph representations of the set of subsumees of...

متن کامل

An automatic test case generator for evaluating implementation of access control policies

One of the main requirements for providing software security is the enforcement of access control policies which aim to protect resources of the system against unauthorized accesses. Any error in the implementation of such policies may lead to undesirable outcomes. For testing the implementation of access control policies, it is preferred to use automated methods which are faster and more relia...

متن کامل

Bridging the Gap between Tableau and Consequence-Based Reasoning

We present a non-deterministic consequence-based procedure for the description logic ALCHI. Just like the similar style (deterministic) procedures for EL and Horn-SHIQ, our procedure explicitly derives subsumptions between concepts, but due to non-deterministic rules, not all of these subsumptions are consequences of the ontology. Instead, the consequences are only those subsumptions that can b...

متن کامل

A Tableau-Based Explainer for DL Subsumption

This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBoxes.

متن کامل

Foundations for the Logical Difference of EL-TBoxes

We investigate the logical difference problem between general EL-TBoxes. The logical difference is the set of concept subsumptions that are logically entailed by a first TBox but not by a second one. We show how the logical difference between two EL-TBoxes can be reduced to fixpoint reasoning w.r.t. EL-TBoxes. Entailments of the first TBox can be represented by subsumptions of least fixpoint co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017